Evaluation of intra-group optimistic data replication in P2P groupware systems

Data Replication in P2P Systems

In a peer-to-peer (p2p) system, a large number of nodes share data with each other. The participation of nodes is highly dynamic; nodes may enter and leave the system at will. Since, it is not possible to maintain links with all nodes, for performance as well as for privacy and anonymity reasons, each node maintains links with a selected subset of other nodes, thus forming an overlay network. A...

Evaluation of Replication Techniques for P2p Systems

An Enhanced Data Replication Method in P2P Systems

P2P applications emerged as a powerful paradigm for sharing information across the internet. They cause much of internet traffic. The unstructured P2P systems usually use a bounded flooding method for searching. Observations have shown that a few of peers share most of data in a file sharing system. In order to increase the success rate of blind search and load balancing, replication techniques...

Optimistic Replication for Internet Data Services

We present a new replication algorithm that supports replication of a large number of objects on a diverse set of nodes. The algorithm allows replica sets to be changed dynamically on a per-object basis. It tolerates most types of failures, including multiple node failures, network partitions, and sudden node retirements. These advantages make the algorithm particularly attractive in large clus...

Optimistic Data Replication for Mobile Applications

The number of mobile devices in use is exploding, and mobile devices are becoming more and more interconnected. As a result, users are demanding mobile access to their favorite applications as well as to new collaborative and group applications made possible by ad hoc networks of mobile clients. Many of these applications need to access data that is shared between multiple mobile clients. Optim...